Speeding up Natural Language Text Search using Compression
نویسندگان
چکیده
منابع مشابه
Speeding Up Pattern Matching by Text Compression
Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an arbitrary part of the original text. However, it has not been so popular since the compression is rather slow and the compression ratio is not as good as other methods such as Lempel-Ziv type compression. In this paper, we bring ...
متن کاملSpeeding up Fractal Image Compression
Fractal coding of digital images ooers many promising qualities. However the coding process suuers from the long search time of the domain block pool. In this paper, we obtain mathematical results on the distance measure used in the search. Then we derive an incremental procedure to bound the domain block pixels. We arrange the domain blocks in a tree structure, and utilise the procedure to dir...
متن کاملSpeeding up keyword search for search engines
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important operations in search engines and numerous other applications. In this paper we propose a new text indexing technique for improving the performance of keyword search. Our proposed technique not only speeds up searching o...
متن کاملSpeeding-Up Fractal Image Compression by Using Classification Range Blocks
In fractal compression technique, an image is partitioned into sub blocks called range blocks, each of which is encoded by matching it (after an appropriate affine transformation) with a block chosen from a large pool of domain blocks, which is constructed from the image itself. The problem is that the encoding is very time consuming because of the need to search in a very large domain pool. Ou...
متن کاملClique Partitions , Graph Compression and Speeding - up
We rst consider the problem of partitioning the edges of a graph G into bipartite cliques such that the total order of the cliques is minimized, where the order of a clique is the number of vertices in it. It is shown that the problem is NP-complete. We then prove the existence of a partition of small total order in a suuciently dense graph and devise an eecient algorithm to compute such a part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2021
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2021.0120452